Solving Object-oriented Configuration Scenarios with ASP

نویسندگان

  • Gottfried Schenner
  • Andreas A. Falkner
  • Anna Ryabokon
  • Gerhard Friedrich
چکیده

The main configuration scenarios occurring in the domain of technical products and systems are consistency checking, completing a partial configuration, reconfiguration of an inconsistent configuration and finding the best knowledge base for future reconfigurations. This paper presents OOASP a framework for the description of object-oriented product configurators using answer set programming and shows that it is able to solve the different (re)configuration scenarios occurring in practice. Thus, it is a step forward to close the conceptual gap between logic-based and object-oriented approaches for product configuration.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Testing Object-Oriented Configurators With ASP

Testing is an important aspect of every software project. For configurator applications it is equally important but often neglected. This paper shows how to support testing object-oriented and constraint-based configurators by automatically generating positive and negative test cases using answer set programming (ASP). The object-model of the configurator is mapped to ASP code; the constraints ...

متن کامل

Integrating Answer Set Programming with Object-Oriented Languages

Answer Set Programming (ASP) is a declarative programming paradigm which allows for easy modeling and solving of hard problems that are often cumbersome to implement in object-oriented programming languages. It was successfully applied to a range of applications from artificial intelligence, such as combinatorial or scheduling problems. On the other hand, real-world applications for end-users u...

متن کامل

AutoFolio: Algorithm Configuration for Algorithm Selection

Algorithm selection (AS) techniques – which involve choosing from a set of algorithms the one expected to solve a given problem instance most efficiently – have substantially improved the state-of-the-art in solving many prominent AI problems, such as SAT, CSP, ASP, MAXSAT, and QBF. Although several AS procedures have been introduced, not too surprisingly, none of them dominates all others acro...

متن کامل

aspcud: A Linux Package Configuration Tool Based on Answer Set Programming

Answer Set Programming (ASP; [3]) owes its increasing popularity as a tool for Knowledge Representation and Reasoning (KRR; [11]) to its attractive combination of a rich yet simple modeling language with high-performance solving capacities. The basic idea of ASP is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an ASP solver...

متن کامل

Unsatisfiability-based optimization in clasp

Answer Set Programming (ASP) features effective optimization capacities based on branch-andbound algorithms. Unlike this, in the area of Satisfiability Testing (SAT) the finding of minimum unsatisfiable cores was put forward as an alternative approach to solving Maximum Satisfiability (MaxSAT) problems. We explore this alternative approach to optimization in the context of ASP. To this end, we ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013